Three primes - HackerEarth Solution

t = int(input())
s=[2]
y=0
for i in range(1,t+1,1):
    y=i
    for j in range(2,y+1//2,1):
        if y%j==0:
            break
        else:
            if y-1==j:
                s.append(y)
            else:
                continue
count = 0
for i in range(len(s)):
    for j in range(len(s)):
        for k in range(len(s)):
            if (s[i]*s[j]*s[k])%(s[i]+s[j]+s[k])==0:
                count+=1
            else:
                continue
print(count)